Linear codes on posets with extension property
نویسندگان
چکیده
We investigate linear and additive codes in partially ordered Hamming-like spaces that satisfy the extension property, meaning that automorphisms of ideals extend to automorphisms of the poset. The codes are naturally described in terms of translation association schemes that originate from the groups of linear isometries of the space. We address questions of duality and invariants of codes, establishing a connection between the dual association scheme and the scheme defined on the dual poset (they are isomorphic if and only if the poset is self-dual). We further discuss invariants that play the role of weight enumerators of codes in the poset case. In the case of regular rooted trees such invariants are linked to the classical problem of tree isomorphism. We also study the question of whether these invariants are preserved under standard operations on posets such as the ordinal sum and the like.
منابع مشابه
A Characterization of Partially Ordered Sets with Linear Discrepancy Equal to 2
The linear discrepancy of a poset P is the least k such that there is a linear extension L of P such that if x and y are incomparable in P, then |hL(x) − hL(y)| ≤ k, where hL(x) is the height of x in L. Tanenbaum, Trenk, and Fishburn characterized the posets of linear discrepancy 1 as the semiorders of width 2 and posed the problem of characterizing the posets of linear discrepancy 2. We show t...
متن کاملIsometries of Additive Codes
(June 15, 2016.) FIX: June 15, 2016. This needs to be re-written. Monomial transformations of linear codes are linear isometries for the Hamming weight. A code alphabet has the extension property for the Hamming weight when every linear isometry between codes extends to a monomial transformation. MacWilliams proved that finite fields have the extension property for the Hamming weight. In contra...
متن کاملMacWilliams Extension Theorem for MDS codes over a vector space alphabet
The MacWilliams Extension Theorem states that each linear isometry of a linear code extends to a monomial map. Unlike the linear codes, in general, additive codes do not have the extension property. In this paper, an analogue of the extension theorem for additive codes in the case of additive MDS codes is proved. More precisely, it is shown that for almost all additive MDS codes their additive ...
متن کاملOrder-Invariant Measures on Fixed Causal Sets
A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the ordertype of the natural numbers – we call such a linear extension a natural extension. We study probability measures on the set of natural extensions of a causal set, especially those measures having the property of order-inva...
متن کاملA radical extension of the category of $S$-sets
Let S-Set be the category of $S$-sets, sets together with the actions of a semigroup $S$ on them. And, let S-Pos be the category of $S$-posets, posets together with the actions compatible with the orders on them. In this paper we show that the category S-Pos is a radical extension of S-Set; that is there is a radical on the category S-Pos, the order desolator radical, whose torsion-free class i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 317 شماره
صفحات -
تاریخ انتشار 2014